#include<iostream>
#include<boost/lambda/lambda.hpp>
#include<boost/graph/adjacency_list.hpp>
#include<algorithm>
#include<iterator>
using namespace std;
using namespace boost::lambda;
using namespace boost;

int main(){
	// typedef istream_iterator<int> in;
	// for_each(	
	// 	in(cin), in(), cout<<(_1 * 3) << " ");
	adjacency_list<listS, vecS, undirectedS> graph1;
	add_edge(0, 1, graph1);
	add_edge(1, 4, graph1);
	add_edge(4, 0, graph1);
	add_edge(2, 5, graph1);
	return 0;
}